Expediente, v. 04, n. 09, dez. 2018

Deutsche Nationalbibliografie 2018 B 09

/ 04 09 21 6 v 1 3 0 Se p 20 04 Stairway Quantum Computer

In the paper is considered stairway-like design of quantum computer, i.e., array of double quantum dots or wells. The model is quite general to include wide variety of physical systems from coupled quantum dots in experiments with solid state qubits, to very complex one, like DNA molecule. At the same time it is concrete enough, to describe main physical principles for implementation of univers...

$n$-cocoherent rings‎, ‎$n$-cosemihereditary rings and $n$-V-rings

 Let $R$ be a ring‎, ‎and let $n‎, ‎d$ be non-negative integers‎. ‎A right $R$-module $M$ is called $(n‎, ‎d)$-projective if $Ext^{d+1}_R(M‎, ‎A)=0$ for every $n$-copresented right $R$-module $A$‎. ‎$R$ is called right $n$-cocoherent if every $n$-copresented right $R$-module is $(n+1)$-coprese-nted‎, ‎it is called a right co-$(n,d)$-ring if every right $R$-module is $(n‎, ‎d)$-projective‎. ‎$R$...

/ 04 06 09 4 v 1 1 4 Ju n 20 04 A Relativistic Version of the Ghirardi – Rimini – Weber Model

Carrying out a research program outlined by John S. Bell in 1987, we arrive at a relativistic version of the Ghirardi–Rimini–Weber (GRW) model of spontaneous wavefunction collapse. As suggested by Bell, we take the primitive ontology, or local beables, of our model to be a discrete set of space-time points, at which the collapses are centered. This set is random with distribution determined by ...

ua nt - p h / 04 01 09 1 v 2 8 Ju n 20 04 Quantum query complexity of some graph problems ∗

Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity of Connectivity, Strong Connectivity, Minimum Spanning Tree, and Single Source Shortest Paths. For example we show that the query complexity of Minimum Spanning Tree is in Θ(...